11/4-colorability of subcubic triangle-free graphs
Bernard Lidický (Iowa State University)
08-Apr-2021, 02:00-03:00 (5 years ago)
Abstract: We prove that every connected subcubic triangle-free graph except for two exceptional graphs on 14 vertices has fractional chromatic number at most 11/4. This is a joint work with Zdenek Dvorak and Luke Postle.
combinatorics
Audience: researchers in the topic
Comments: pw 121323
Series comments: Check scmscomb.github.io/ for more information
Export talk to